Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search
نویسندگان
چکیده
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approach could only solve problems admitting a sequential solution. The paper introduces a revised plan representation supporting concurrency and some new search techniques using it, which are implemented in a new version of the LPG planner. An experimental analysis indicates that the proposed approach is suitable to temporal planning with requiring concurrency and is competitive with state-of-the-art planners.
منابع مشابه
Fast Planning in Domains with Derived Predicates: An Approach Based on Rule-Action Graphs and Local Search
The ability to express “derived predicates” in the formalization of a planning domain is both practically and theoretically important. In this paper, we propose an approach to planning with derived predicates where the search space consists of “Rule-Action Graphs”, particular graphs of actions and rules representing derived predicates. We present some techniques for representing rules and reaso...
متن کاملPlanning Through Stochastic Local Search and Temporal Action Graphs in LPG
We present some techniques for planning in domains specified with the recent standard language pddl2.1, supporting “durative actions” and numerical quantities. These techniques are implemented in lpg, a domain-independent planner that took part in the 3rd International Planning Competition (IPC). lpg is an incremental, any time system producing multi-criteria quality plans. The core of the syst...
متن کاملLocal Search Techniques for Temporal Planning in LPG
We present some techniques for planning in temporal domains specified with the recent standard languange PDDL2.1. These techniques are implemented in LPG, a fully-automated system that took part in the third International Planning Competition (Toulouse, 2002) showing excellent performance. The planner is based on a stochastic local search method and on a graph-based representation called “Tempo...
متن کاملWhen is Temporal Planning Really Temporal?
While even STRIPS planners must search for plans of unbounded length, temporal planners must also cope with the fact that actions may start at any point in time. Most temporal planners cope with this challenge by restricting action start times to a small set of decision epochs, because this enables search to be carried out in state-space and leverages powerful state-based reachability heuristic...
متن کاملResearch in Concurrent Planning
While even STRIPS planners must search for plans of unbounded length, temporal planners must also cope with the fact that actions may start at any point in time. Most temporal planners cope with this challenge by restricting action start times to a small set of decision epochs, because this enables search to be carried out in state-space and leverages powerful state-based reachability heuristic...
متن کامل